Automorphisms of Steiner triple systems
نویسنده
چکیده
Abstract: Steiner triple systems are among the simplest and most intensively studied combinatorial designs. Their origins go back to the 1840s, and there exists by now a sizeable literature on the topic. In 1980, Babai proved that almost all Steiner triple systems have no nontrivial automorphism. On the other hand, there exist Steiner triple systems with large automorphism groups. We will discuss questions dealing with classification of ”highly symmetric” Steiner triple systems, as well as some open problems in the area.
منابع مشابه
Embedding partial Steiner triple systems so that their automorphisms extend
It is shown that there is a function g on the natural numbers such that a partial Steiner triple system U on u points can be embedded in a Steiner triple system V on v points, in such a way that all automorphisms of U can be extended to V , for every admissible v satisfying v > g(u). We find exponential upper and lower bounds for g.
متن کاملIsomorphisms of Infinite Steiner Triple Systems II
A combinatorial method in conjuction with the results presented in [F] is introduced to prove that for any infinite cardinal κ, and every cardinal λ, 0≤λ≤κ, there are 2 mutually non-isomorphic Steiner triple systems of size κ that admit exactly 2 automorphisms. In particular, there are 2 mutually non-isomorphic rigid Steiner triple systems of size κ.
متن کاملOn the resolutions of cyclic Steiner triple systems with small parameters ∗
The paper presents useful invariants of resolutions of cyclic STS(v) with v ≤ 39, namely of all resolutions of cyclic STS(15), STS(21) and STS(27), of the resolutions with nontrivial automorphisms of cyclic STS(33) and of resolutions with automorphisms of order 13 of cyclic STS(39). 2010 MSC: 05B07, 05E18
متن کاملSteiner Triple Systems of Order 19 with Nontrivial Automorphism Group
There are 172,248 Steiner triple systems of order 19 having a nontrivial automorphism group. Computational methods suitable for generating these designs are developed. The use of tactical configurations in conjunction with orderly algorithms underlies practical techniques for the generation of the designs, and the subexponential time isomorphism technique for triple systems is improved in pract...
متن کاملThe Automorphism Groups of Steiner Triple Systems Obtained by the Bose Construction
The automorphism group of the Steiner triple system of order v ≡ 3 (mod 6), obtained from the Bose construction using any Abelian Group G of order 2s + 1, is determined. The main result is that if G is not isomorphic to Zn 3 × Zm 9 , n ≥ 0, m ≥ 0, the full automorphism group is isomorphic to Hol(G)× Z3, where Hol(G) is the Holomorph of G. If G is isomorphic to Zn 3 × Zm 9 , further automorphism...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015